Multistate nested canalizing functions

نویسندگان

  • J. O. Adeyeye
  • C. Kadelka
  • R. Laubenbacher
  • Y. Li Department of Mathematics
  • Winston-Salem State University
  • Bioinformatics InstituteDepartment of Mathematics
  • Virginia Tech
  • Blacksburg
  • VA
چکیده

The concept of a nested canalizing Boolean function has been studied over the course of the last decade in the context of understanding the regulatory logic of molecular interaction networks, such as gene regulatory networks. Such functions appear preferentially in published models of such networks. Recently, this concept has been generalized to include multi-state functions, and a recursive formula has been derived for their number, as a function of the number of variables. This paper carries out a detailed analysis of the class of nested canalizing functions over an arbitrary finite field. Furthermore, the paper generalizes the concept further, and derives a closed formula for the number of such generalized functions. The paper also derives a closed formula for the number of equivalence classes under permutation of variables. This is motivated by the fact that two nested canalizing functions that differ by a permutation of the variables share many important properties with each other. The paper contributes to the effort of identifying a class of functions over finite fields that are of interest in biology and also have interesting mathematical properties.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multistate nested canalizing functions and their networks

This paper provides a collection of mathematical and computational tools for the study of robustness in nonlinear gene regulatory networks, represented by timeand state-discrete dynamical systems taking on multiple states. The focus is on networks governed by nested canalizing functions (NCFs), first introduced in the Boolean context by S. Kauffman. After giving a general definition of NCFs we ...

متن کامل

On canalizing Boolean functions

Boolean networks are an important model of gene regulatory networks in systems and computational biology. Such networks have been widely studied with respect to their stability and error tolerance. It has turned out that canalizing Boolean functions and their subclass, the nested canalizing functions, appear frequently in such networks. These classes have been shown to have a stabilizing effect...

متن کامل

Boolean nested canalizing functions: A comprehensive analysis

Boolean network models of molecular regulatory networks have been used successfully in computational systems biology. The Boolean functions that appear in published models tend to have special properties, in particular the property of being nested canalizing, a concept inspired by the concept of canalization in evolutionary biology. It has been shown that networks comprised of nested canalizing...

متن کامل

Stratification and enumeration of Boolean functions by canalizing depth

Boolean network models have gained popularity in computational systems biology over the last dozen years. Many of these networks use canalizing Boolean functions, which has led to increased interest in the study of these functions. The canalizing depth of a function describes how many canalizing variables can be recursively “picked off”, until a non-canalizing function remains. In this paper, w...

متن کامل

Phase transition of Boolean networks with partially nested canalizing functions

We generate the critical condition for the phase transition of a Boolean network governed by partially nested canalizing functions for which a fraction of the inputs are canalizing, while the remaining non-canalizing inputs obey a complementary threshold Boolean function. Past studies have considered the stability of fully or partially nested canalizing functions paired with random choices of t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013